K-d tree - PDFSEARCH.IO - Document Search Engine

K-d tree
Results: 206

#	Item
41	CCCG 2013, Waterloo, Ontario, August 8–10, 2013 Data Structures for Incremental Extreme Ray Enumeration Algorithms Blagoy Genov∗ Abstract Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2013-08-11 21:51:58 Theoretical computer science Algorithm Mathematical logic Randomized algorithm Binary search tree K-d tree Mathematics Applied mathematics Binary trees
42	Computing Nearest-Neighbor Fields via Propagation-Assisted KD-Trees Kaiming He Jian Sun Microsoft Research Asia Abstract Add to Reading List Source URL: research.microsoft.com Language: English - Date: 2012-03-19 08:26:17 Information retrieval K-d tree Backtracking Nearest neighbor search Bin Locality-sensitive hashing T-tree Algorithm K-nearest neighbor algorithm Search algorithms Information science Mathematics
43	EUROGRAPHICST. Akenine-Möller and M. Zwicker (Guest Editors) Volume), Number 2 Fitted BVH for Fast Raytracing of Metaballs Add to Reading List Source URL: www.irit.fr Language: English - Date: 2010-02-03 10:48:47 Geometry Metaballs Bounding volume hierarchy Bounding volume Isosurface Minimum bounding box Ray tracing Tree traversal K-d tree 3D computer graphics Computer graphics Computing
44	28 CHAPTER 14. APPROXIMATE TREE PATTERN MATCHING Zhang, K., R. Statman and D. Shasha [1992]. \On the editing distance between unordered Add to Reading List Source URL: www.cs.nyu.edu Language: English - Date: 2006-04-04 16:44:52 Knowledge representation Tree Approximate string matching Pruning Systems science Dynamic programming Control theory Systems theory
45	CCCG 2011, Toronto ON, August 10–12, 2011 On Finding Skyline Points for Range Queries in Plane Anil Kishore Kalavagattu ∗ Add to Reading List Source URL: 2011.cccg.ca Language: English - Date: 2011-08-06 04:11:15 Search algorithms Binary trees Fractional cascading Range searching Bin FO Computational geometry Lowest common ancestor K-d tree Graph theory Mathematics Theoretical computer science
46	CCCG 2011, Toronto ON, August 10–12, 2011 A Discrete and Dynamic Version of Klee’s Measure Problem Hakan Yıldız∗ John Hershberger† Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2011-08-06 04:11:13 Computing R-tree Segment tree K-d tree Measure B-tree Interval tree Fractional cascading Graph theory Binary trees Data management
47	Space-Efficient Algorithms for Klee’s Measure Problem Eric Y. Chen∗ Timothy M. Chan† rithm needs one priority queue and one segment tree Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2005-07-31 13:55:46 Segment tree K-d tree Bin Implicit data structure In-place algorithm Selection algorithm Priority queue H tree Algorithm Computing Mathematics Computer programming
48	CCCG 2006, Kingston, Ontario, August 14–16, Approximate) Conic Nearest Neighbors and the induced Voronoi Diagram Stefan Funke†∗ Theocharis Malamatos† Add to Reading List Source URL: cccg.ca Language: English - Date: 2006-06-29 12:03:57 Search algorithms Discrete geometry Computational geometry Approximation algorithms Diagrams Voronoi diagram Nearest neighbor search Cone K-d tree Geometry Mathematics Information science
49	CCCG 2011, Toronto ON, August 10–12, 2011 A Discrete and Dynamic Version of Klee’s Measure Problem Hakan Yıldız∗ John Hershberger† Add to Reading List Source URL: 2011.cccg.ca Language: English - Date: 2011-08-06 04:11:13 Computing R-tree Segment tree K-d tree Measure B-tree Interval tree Fractional cascading Graph theory Binary trees Data management
50	CCCG 2013, Waterloo, Ontario, August 8–10, 2013 The Unified Segment Tree and its Application to the Rectangle Intersection Problem David P. Wagner∗ Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2013-08-11 21:51:58 R-tree Computer programming Segment tree K-d tree H tree Tree Bin Rope Binary trees Computing Data management

UPDATE